Learning symmetric causal independence models
نویسندگان
چکیده
منابع مشابه
EM Algorithm for Symmetric Causal Independence Models
Causal independence modelling is a well-known method both for reducing the size of probability tables and for explaining the underlying mechanisms in Bayesian networks. In this paper, we present the EM algorithm to learn the parameters in causal independence models based on the symmetric Boolean function. The developed algorithm enables us to assess the practical usefulness of the symmetric cau...
متن کاملSymmetric Causal Independence Models for Classification
Causal independence modelling is a well-known method both for reducing the size of probability tables and for explaining the underlying mechanisms in Bayesian networks. In this paper, we propose an application of an extended class of causal independence models, causal independence models based on the symmetric Boolean function, for classification. We present an EM algorithm to learn the paramet...
متن کاملStructure and Parameter Learning for Causal Independence and Causal Interaction Models
We begin by discussing causal independence models and generalize these models to causal interaction models Causal interaction mod els are models that have independent mech anisms where mechanisms can have several causes In addition to introducing several particular types of causal interaction mod els we show how we can apply the Bayesian approach to learning causal interaction mod els obtaining...
متن کاملParameter Estimation in Large Causal Independence Models
The assessment of a probability distribution that is associated with a Bayesian network is a challenging task, even if its topology is sparse. Special probability distributions, based on the notion of causal independence, have therefore been proposed, as these allow defining a probability distribution in terms of Boolean combinations of local distributions. However, for very large networks even...
متن کاملKnowledge Intensive Learning: Combining Qualitative Constraints with Causal Independence for Parameter Learning in Probabilistic Models By
Shuo Yang Medical problems are examples of knowledge-rich and data-poor domains. There is abounding knowledge about the target features ascribing to the centuries of medical research while the positive samples are rare due to the peculiarity of some diseases. Because the training data is so sparse, a learning algorithm that builds predictive models must be able to exploit the availability of su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2008
ISSN: 0885-6125,1573-0565
DOI: 10.1007/s10994-007-5041-7